Scheduling with incompatible jobs
نویسندگان
چکیده
منابع مشابه
Scheduling with Incompatible Jobs
We consider scheduling problems in a multiprocessor system with incompatible jobs (two incompatible jobs cannot be processed by the same machine). We consider the problem to minimize the maximum job completion time. the makespan. This problem is NP-complete. We present a number of polynomial time approximation algorithms for this problem where the job incompatibilities possess a special structu...
متن کاملMultiple orders per job batch scheduling with incompatible jobs
The growth in demand for semiconductors has been accompanied by intense competition between semiconductor manufacturers to satisfy customer on-time delivery needs. This paper is motivated by scheduling the wafer fabrication phase of 300-mm semiconductor manufacturing, as it contains both batch processing operations and multiple customer orders being grouped into production jobs. The resulting m...
متن کاملAnt Colony Optimization Approaches for Scheduling Jobs with Incompatible Families on Parallel Batch Machines
In this paper, we suggest an Ant Colony System (ACS) to solve a scheduling problem for jobs with incompatible families on parallel batch machines. We are interested in minimizing total weighted tardiness (TWT) of the jobs. Problems of this type have practical importance in semiconductor manufacturing. The ACS scheme includes an efficient local search technique based on swapping jobs across diff...
متن کاملHeuristic scheduling of jobs on parallel batch machines with incompatible job families and unequal ready times
This research is motivated by a scheduling problem found in the di6usion and oxidation areas of semiconductor wafer fabrication, where the machines can be modeled as parallel batch processors. We attempt to minimize total weighted tardiness on parallel batch machines with incompatible job families and unequal ready times of the jobs. Given that the problem is NP-hard, we propose two di6erent de...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1994
ISSN: 0166-218X
DOI: 10.1016/0166-218x(94)90009-4